Investigating the parameter space of evolutionary algorithms
نویسندگان
چکیده
منابع مشابه
Parameter Control in Evolutionary Algorithms
The issue of controlling values of various parameters of an evolutionary algorithm is one of the most important and promising areas of research in evolutionary computation: It has a potential of adjusting the algorithm to the problem while solving the problem. In this paper we: 1) revise the terminology, which is unclear and confusing, thereby providing a classification of such control mechanis...
متن کاملFrom MEGATON to RASCAL: Surfing the Parameter Space of Evolutionary Algorithms
The practice of evolutionary algorithms involves a mundane yet inescapable phase, namely, finding parameters that work well. How big should the population be? How many generations should the algorithm run? What is the (tournament selection) tournament size? What probabilities should one assign to crossover and mutation? All these nagging questions need good answers if one is to embrace success....
متن کاملAutomated Parameter Control for Evolutionary Algorithms
This paper focuses on several aspects to be considered when designing generic control strategies for Evolutionary Algorithms. We propose a method to encapsulate multiple parameters, reducing control to only one variable. This method allows to define generic control strategies regardless of the algorithm’s operators and of the problem to be solved. Three implementation-independent strategies are...
متن کاملEvolutionary Algorithms for Constrained Parameter Optimization Problems
Evolutionary computation techniques have received a lot of attention regarding their potential as optimization techniques for complex numerical functions. However, they have not produced a signi cant breakthrough in the area of nonlinear programming due to the fact that they have not addressed the issue of constraints in a systematic way. Only recently several methods have been proposed for han...
متن کاملDynamic Parameter Control in Simple Evolutionary Algorithms
Evolutionary algorithms are general, randomized search heuristics that are influenced by many parameters. Though evolutionary algorithms are assumed to be robust, it is well-known that choosing the parameters appropriately is crucial for success and efficiency of the search. It has been shown in many experiments, that non-static parameter settings can be by far superior to static ones but theor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioData Mining
سال: 2018
ISSN: 1756-0381
DOI: 10.1186/s13040-018-0164-x